Clustering Related Tuples in Databases
نویسندگان
چکیده
منابع مشابه
Clustering Symbolic Time-Series using L-tuples
Among the many dimensionality reduction methods for timeseries data, Symbolic Aggregate approXimation (SAX) is perhaps the most popular due to its simplicity and uniqueness. With SAX, time-series data can be represented as string sequences which enables the utilization of methods found in text mining and bioinformatics to enhance data mining tasks. We propose an application of L-tuples to impro...
متن کاملPartial and Complete Tuples and Sets in Deductive Databases
In a nested relational or complex object database, nested tuples and sets are used to represent real world objects. For various reasons, such tuples and sets can be partial or complete. In this paper, we discuss how to support them in deductive databases. In particular, we present a deductive database language RLOG II that supports partial and complete tuples and sets based on Relationlog. This...
متن کاملSemantic Management of Deduplicate Tuples in the Relational Databases
Relational database is a collection of relations. Duplicate tuple existence is common in many real time relational databases. In a relational database, if the same real-world entity is represented by more than one tuple, then such tuples are called duplicate tuples. Finding duplicate tuples and then replacing them by one best tuple is called a fusion operation. Whenever duplicate tuples are fou...
متن کاملClustering Categorical Sequences with Variable-Length Tuples Representation
Clustering categorical sequences is currently a difficult problem due to the lack of an efficient representation model for sequences. Unlike the existing models, which mainly focus on the fixed-length tuples representation, in this paper, a new representation model on the variablelength tuples is proposed. The variable-length tuples are obtained using a pruning method applied to delete the redu...
متن کاملClustering Deep Web Databases Semantically
Deep Web database clustering is a key operation in organizing Deep Web resources. Cosine similarity in Vector Space Model (VSM) is used as the similarity computation in traditional ways. However it cannot denote the semantic similarity between the contents of two databases. In this paper how to cluster Deep Web databases semantically is discussed. Firstly, a fuzzy semantic measure, which integr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1988
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/31.3.253